Formal Bott–Thurston Cocycle and Part of a Formal Riemann–Roch Theorem

نویسندگان

چکیده

The Bott–Thurston cocycle is a $$2$$ -cocycle on the group of orientation-preserving diffeomorphisms circle. We introduce and study formal analog cocycle. continuous $$A$$ -automorphisms algebra $$A((t))$$ Laurent series over commutative ring with values in $$A^*$$ invertible elements . prove that central extension given by equivalent to 12-fold Baer sum determinantal when $$\mathbb Q$$ -algebra. As consequence this result we part new Riemann–Roch theorem. This theorem applied ringed space separated scheme $$S$$ , where structure sheaf locally isomorphic $$\mathcal O_S((t))$$ transition automorphisms are continuous. Locally corresponds punctured neighborhood section smooth morphism $$U$$ relative dimension $$1$$ $$U \subset S$$ an open subset.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

?Logic and Formal Ontology: Is the Final Formal Ontology Possible

Musa Akrami AbstractMany philosophers and logicians have contemplated the relationship between ontology and logic. The author of this paper, working within a Bolzanoan-Husserlian tradition of studying both ontology and logic, considers ontology as the science of the most general features of beings and the most general relations among them. He considers logic as the science concernin...

متن کامل

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

A Formal Frobenius Theorem and Argument Shift

A formal Frobenius theorem, which is an analog of the classical integrability theorem for smooth distributions, is proved and applied to generalize the argument shift method of A. S. Mishchenko and A. T. Fomenko to finite-dimensional Lie algebras over any field of characteristic zero. A completeness criterion for a commutative set of polynomials constructed by the formal argument shift method i...

متن کامل

A formal proof of Pick's Theorem

We start by establishing the result for an elementary triangle: one whose vertices are lattice points and which contains no other lattice points either in its interior or boundary. Pick’s theorem for such a triangle simply asserts that it has area 1/2, or 0 in the degenerate cases where it is flat. Given two vectors A and B, we can consider them as defining the linear transformation of the plan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Steklov Institute of Mathematics

سال: 2023

ISSN: ['1531-8605', '0081-5438']

DOI: https://doi.org/10.1134/s0081543823010108